#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
int n,a[N];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1;i <= n;i++) scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    queue<int> q;
    q.push(a[1]);
    for(int i = 2;i <= n;i++){
        if(a[i] > q.front()) q.pop();
        q.push(a[i]);
    }
    printf("%d\n",q.size());
    return 0;
}
